Representing split graphs by words
نویسندگان
چکیده
منابع مشابه
Representing Graphs via Pattern Avoiding Words
Abstract The notion of a word-representable graph has been studied in a series of papers in the literature. A graph G = (V,E) is word-representable if there exists a word w over the alphabet V such that letters x and y alternate in w if and only if xy is an edge in E. If V = {1, . . . , n}, this is equivalent to saying that G is wordrepresentable if for all x, y ∈ {1, . . . , n}, xy ∈ E if and ...
متن کاملRepresenting Words as Lymphocytes
Similarity between words is becoming a generic problem for many applications of computational linguistics, and computing word similarities is determined by word representations. Inspired by the analogies between words and lymphocytes, a lymphocyte-style word representation is proposed. The word representation is built on the basis of dependency syntax of sentences and represent word context as ...
متن کاملRepresenting Hyper-Graphs by Regular Languages
A new compact representation of innnite graphs is investigated. Regular languages are used to represent labelled hyper-graphs which can be also multi-graphs. Our approach is similar to that used by A. Ehrenfeucht et al. for nite graphs since we use a regular preex-free language as set of vertices, but it diiers from that in the representation of the edges. In fact, we use a regular language for...
متن کاملOn Representing Graphs by Touching Cuboids
We consider contact representations of graphs where vertices are represented by cuboids, i.e. interior-disjoint axis-aligned boxes in 3D space. Edges are represented by a proper contact between the cuboids representing their endvertices. Two cuboids make a proper contact if they intersect and their intersection is a non-zero area rectangle contained in the boundary of both. We study representat...
متن کاملSplit-critical and uniquely split-colorable graphs
The split-coloring problem is a generalized vertex coloring problem where we partition the vertices into a minimum number of split graphs. In this paper, we study some notions which are extensively studied for the usual vertex coloring and the cocoloring problem from the point of view of split-coloring, such as criticality and the uniqueness of the minimum split-coloring. We discuss some proper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2020
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2344